Matchmaking with Answer Set Programming
نویسندگان
چکیده
Matchmaking is a form of scheduling that aims at bringing companies or people together that share common interests, services, or products in order to facilitate future business partnerships. We begin by furnishing a formal characterization of the corresponding multi-criteria optimization problem. We then address this problem by Answer Set Programming in order to solve real-world matchmaking instances, which were previously dealt with by special-purpose algorithms.
منابع مشابه
A New Matchmaking Approach Based on Abductive Conjunctive Query Answering
To perform matchmaking in Web-based scenarios where data are often incomplete, we propose an extended conjunctive query answering (CQA) problem, called abductive CQA problem, in Description Logic ontologies. Given a consistent ontology and a conjunctive query, the abductive CQA problem computes all abductive answers to the query in the ontology. An abductive answer is an answer to the query in ...
متن کاملMatchmaking Frameworks for Distributed Resource Management
Federated distributed systems present new challenges to resource management. Conventional resource managers are based on a relatively static resource model and a centralized allocator that assigns resources to customers. Distributed environments, particularly those built to support high-throughput computing (HTC), are often characterized by distributed management and distributed ownership. Dist...
متن کاملComparing Approaches for Semantic Service Description and Matchmaking1
Matching descriptions of user requirements against descriptions of service capabilities is crucial for the discovery of appropriate services for a given task. To improve the precision of approaches that consider only syntactical aspects of matchmaking (e.g. UDDI) several approaches for semantic matchmaking have been proposed. We compare two approaches with respect to their potentials for matchm...
متن کاملComparing Approaches for Semantic Service Description and Matchmaking
Matching descriptions of user requirements against descriptions of service capabilities is crucial for the discovery of appropriate services for a given task. To improve the precision of approaches that consider only syntactical aspects of matchmaking (e.g. UDDI) several approaches for semantic matchmaking have been proposed. We compare two approaches with respect to their potentials for matchm...
متن کاملMatchmaking: How similar is what I want to what I get
We introduce matchmaking as a specific setting for similarity assessment. While in many domains similarity assessment is between pairs of entities with equal status, this is not true for matchmaking in general. Usually, in matchmaking there exists a source request which triggers search for the most similar set of available entities. Whether an entity is acceptable depends highly on the applicat...
متن کامل